Bi-complement Reducible Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducible properties of graphs

Let IL be the set of all hereditary and additive properties of graphs. For P1,P2 ∈ IL, the reducible property R = P1 ◦ P2 is defined as follows: G ∈ R if and only if there is a partition V (G) = V1 ∪ V2 of the vertex set of G such that 〈V1〉G ∈ P1 and 〈V2〉G ∈ P2. The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the dec...

متن کامل

Transitive orientations in bull-reducible Berge graphs

A bull is a graph with five vertices r, y, x, z, s and five edges ry, yx, yz, xz, zs. A graph G is bull-reducible if no vertex of G lies in two bulls. We prove that every bull-reducible Berge graph G that contains no antihole is weakly chordal, or has a homogeneous set, or is transitively orientable. This yields a fast polynomial time algorithm to color exactly the vertices of such a graph.

متن کامل

Acyclic reducible bounds for outerplanar graphs

For a given graph G and a sequence P1,P2, . . . ,Pn of additive hereditary classes of graphs we define an acyclic (P1,P2, . . . ,Pn)colouring of G as a partition (V1, V2, . . . , Vn) of the set V (G) of vertices which satisfies the following two conditions: 1. G[Vi] ∈ Pi for i = 1, . . . , n, 2. for every pair i, j of distinct colours the subgraph induced in G by the set of edges uv such that u...

متن کامل

Complement of Special Chordal Graphs and Vertex Decomposability

In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.

متن کامل

Bi-Cohen-Macaulay graphs

In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General biCohen-Macaulay graphs are classified up to separation. The inseparable bi-CohenMacaulay graphs are determined. We establish a bijection between the set of all trees and the set of inseparable bi-Cohen-Macaulay graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 1997

ISSN: 0196-8858

DOI: 10.1006/aama.1996.0519